Modal Logics for Observation Equivalences

نویسندگان

  • Jan Rothe
  • Dragan Masulovic
چکیده

In our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show that parts of the theory of universal coalgebra (with strong bisimulation) can be obtained when considering coalgebras with weak bisimulations and weak homomorphisms. In the present paper we focus on uniformly adapting modal logics that characterise strong bisimulation for coalgebras to several kinds of observation equivalences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propositional Temporal Logics and Equivalences

We compare propositional temporal logics by comparing the equivalences that they induce on models. Linear time, branching time and partial order temporal logics are considered. The logics are interpreted on occurrence transition systems, generated by labelled prime event structures without auto-concurrency. The induced equivalences are also compared to directly deened equivalences, e.g., histor...

متن کامل

Modal Logics for Mobile Processes

In process algebras bisimulation equivalence is typically de ned directly in terms of the operational rules of action it also has an alternative characterization in terms of a simple modal logic sometimes called Hennessy Milner logic This paper rst de nes two forms of bisimulation equivalence for the calculus a process algebra which allows dynamic recon guration among processes it then explores...

متن کامل

Model Checking and Other Games

3 Equivalences, Modal and Temporal Logics 5 3.1 Interactive games and bisimulations . . . . . . . . . . . . . . . 7 3.2 Modal logic and bisimulations . . . . . . . . . . . . . . . . . . . 9 3.3 Temporal properties and modal mu-calculus . . . . . . . . . . 10 3.4 Second-order propositional modal logic . . . . . . . . . . . . . . 15 3.5 Fixed point and second-order games . . . . . . . . . . . . ....

متن کامل

Logical characterization of probabilistic τ -bisimulation equivalences

Stochastic Petri nets (SPNs) is a well-known model for quantitative analysis. We consider the class called DTWSPNs that is a modification of discrete time SPNs (DTSPNs) by transition labeling and weights. Transitions of DTWSPNs are labeled by actions that represent elementary activities and can be visible or invisible for an external observer. For DTWSPNs, interleaving and step probabilistic τ ...

متن کامل

A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

Behavioral equivalences are a means to establish whether computing systems possess the same properties. The specific set of properties that are preserved by a specific behavioral equivalence clearly depends on how the system behavior is observed and can usually be characterized by means of a modal logic. In this paper we consider three different approaches to the definition of behavioral equiva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 82  شماره 

صفحات  -

تاریخ انتشار 2003